Minimal cluster computation for four planar regions with the same area
نویسندگان
چکیده
منابع مشابه
Clustering with Same-Cluster Queries
We propose a framework for Semi-Supervised Active Clustering framework (SSAC), where the learner is allowed to interact with a domain expert, asking whether two given instances belong to the same cluster or not. We study the query and computational complexity of clustering in this framework. We consider a setting where the expert conforms to a center-based clustering with a notion of margin. We...
متن کاملMinimal Surfaces with Planar Boundary Curves
In 1956, Shiffman [Sh] proved that any compact minimal annulus with two convex boundary curves (resp. circles) in parallel planes is foliated by convex planar curves (resp. circles) in the intermediate planes. In 1978, Meeks conjectured that the assumption the minimal surface is an annulus is unnecessary [M]; that is, he conjectured that any compact connected minimal surface with two planar con...
متن کاملApproximate Clustering with Same-Cluster Queries
Ashtiani et al. proposed a Semi-Supervised Active Clustering framework (SSAC), where the learner is allowed to make adaptive queries to a domain expert. The queries are of the kind “do two given points belong to the same optimal cluster?”, and the answers to these queries are assumed to be consistent with a unique optimal solution. There are many clustering contexts where such same cluster quer...
متن کاملCluster storage for commodity computation
Standards in the computer industry have made basic components and entire architectures into commodities, and commodity hardware is increasingly being used for the heavy lifting formerly reserved for specialised platforms. Now software and services are following. Modern updates to vir-tualization technology make it practical to subdivide commodity servers and manage groups of heterogeneous servi...
متن کاملPlanar 4-critical graphs with four triangles
By the Grünbaum-Aksenov Theorem (extending Grötzsch’s Theorem) every planar graph with at most three triangles is 3-colorable. However, there are infinitely many planar 4-critical graphs with exactly four triangles. We describe all such graphs. This answers a question of Erdős from 1990.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geometric Flows
سال: 2018
ISSN: 2353-3382
DOI: 10.1515/geofl-2018-0007